Testing idealness in the filter oracle model

نویسندگان

چکیده

A filter oracle for a clutter consists of finite set V and an which, given any X⊆V, decides in unit time whether X contains member the clutter. Let A2n be algorithm that, C over 2n elements via oracle, is ideal. We prove that worst case, makes at least 2n−1 calls to oracle. Our proof uses theory cuboids.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Partial Test Oracle in Model Transformation Testing

Writing test oracles for model transformations is a difficult task. First, oracles must deal with models which are complex data. Second, the tester cannot always predict the expected value of all the properties of the output model produced by a transformation. In this paper, we propose an approach to create efficient oracles for validating part of the produced output model. In this approach we ...

متن کامل

The Oracle Problem When Testing from MSCs

Message Sequence Charts (MSCs) form a popular language in which scenariobased specifications and models can be written. There has been significant interest in automating aspects of testing from MSCs. This paper concerns the Oracle Problem, in which we have an observation made in testing and wish to know whether this is consistent with the specification. We assume that there is an MSC specificat...

متن کامل

Short Signatures in the Random Oracle Model

We study how digital signature schemes can generate signatures as short as possible, in particular in the case where partial message recovery is allowed. We give a concrete proposition named OPSSR that achieves the lower bound for message expansion, and give an exact security proof of the scheme in the ideal cipher model. We extend it to the multi-key setting. We also show that this padding can...

متن کامل

Oracle Separation in the Non-uniform Model

Oracle separation methods are used in cryptography to rule out blackbox reductions between cryptographic primitives. It is sufficient to find an oracle relative to which the base primitive exists but there are no secure instances of the constructed primitive. In practice, it is beyond our current reach to construct a fixed oracle with such properties for most of the reductions because it is dif...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Operations Research Letters

سال: 2022

ISSN: ['0167-6377', '1872-7468']

DOI: https://doi.org/10.1016/j.orl.2022.11.004